Learning generalized Nash equilibria in monotone games: A hybrid adaptive extremum seeking control approach
نویسندگان
چکیده
In this paper, we solve the problem of learning a generalized Nash equilibrium (GNE) in merely monotone games. First, propose novel continuous semi-decentralized solution algorithm without projections that uses first-order information to compute GNE with central coordinator. As second main contribution, design gain adaptation scheme for previous order alleviate improper scaling cost functions versus constraints. Third, data-driven variant former algorithm, where each agent estimates their individual pseudogradient via zeroth-order information, namely, measurements function values. Finally, apply our method perturbation amplitude optimization oil extraction engineering.
منابع مشابه
A Douglas-Rachford splitting for semi-decentralized generalized Nash equilibrium seeking in Monotone Aggregative Games
We address the generalized Nash equilibrium seeking problem for noncooperative agents playing non-strictly monotone aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized Nash equilibria of the game as the zeros of a monotone setvalued operator. Then, we massage the Douglas–Rachford splitting to solve the monotone inclusion problem and ...
متن کاملMonotone operator methods for Nash equilibria in non-potential games
We observe that a significant class of Nash equilibrium problems in non-potential games can be associated with monotone inclusion problems. We propose splitting techniques to solve such problems and establish their convergence. Applications to generalized Nash equilibria, zero-sum games, and cyclic proximation problems are demonstrated.
متن کاملParameter convergence in adaptive extremum-seeking control
This paper addresses the problem of parameter convergence in adaptive extremum seeking control design. An alternate version of the popular persistence of excitation condition is proposed for a class of nonlinear systems with parametric uncertainties. The condition is translated to an asymptotic sufficient richness condition on the reference set-point. Since the desired optimal set-point is not ...
متن کاملLearning Nash Equilibria in Non-Cooperative Games
Game Theory (Von Neumann & Morgenstern, 1944) is a branch of applied mathematics and economics that studies situations (games) where self-interested interacting players act for maximizing their returns; therefore, the return of each player depends on his behaviour and on the behaviours of the other players. Game Theory, which plays an important role in the social and political sciences, has rec...
متن کاملLearning Nash Equilibria in Congestion Games
We study the repeated congestion game, in which multiple populations of players share resources, and make, at each iteration, a decentralized decision on which resources to utilize. We investigate the following question: given a model of how individual players update their strategies, does the resulting dynamics of strategy profiles converge to the set of Nash equilibria of the one-shot game? W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2023
ISSN: ['1873-2836', '0005-1098']
DOI: https://doi.org/10.1016/j.automatica.2023.110931